757B - Bash's Big Day - CodeForces Solution

#include "bits/stdc++.h"
using namespace std; 

using ll = long long; 

const int N = 1e5 + 1;
vector <int> primes;
vector <bool> f(N, 0); 



void solve () {
    int n; cin >> n; 
    // vector <int> v;
    int h[N] = {0}; 
    for (int i = 0; i < n; i++) {
    	int y; cin >> y;
    	h[y]++;
    }
    int ans = 1; 
    for (int i = 2; i < N; i += 1) {
    	int res = 0; 
    	for (int j = i; j < N; j += i) {
    		res += h[j];
    	}
    	ans = max(ans, res); 
    }
    cout << ans << '\n';
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    //pre(); 
  //  cin >> t;
    for (int i = 1; i <= t; i++) {
      solve();
    }
    return 0; 
}